Bridging to Infinity

Counting to Infinity

Routing protocols have to deal with a known problem: the count-to-infinity. Counting to infinity can occur when a link breaks in the network, and the algorithm in the routing protocol tries to calculate new shortest paths. In this paper I survey the past and present solutions to the this problem.

To Infinity and Beyond

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton. The study on how (semi)groups grow has been highlighted since Milnor’s question on the existence of groups of intermediate...

To infinity, and beyond!

Herding Cats to Infinity

This paper outlines and contextualises some current findings of an on-going investigation begun in 2009 at the Visual Effects Research Lab (VERL). The three-year project links the worlds of film, art, technology and computer science. In sharing methodologies and promoting cross-, transand inter-disciplinary understanding the project is beginning to challenge established notions of visual though...

To Infinity and Beyond

Computer algebra systems (CAS) are sometimes expected to compute with infinities symbolically. Since operations on such objects do not always conform to a sufficient and consistent set of rules for ordinary arithmetic, some compromises are necessary. We discuss a few options and implementations.